Remarks on random walks on graphs and the Floyd boundary

نویسندگان

چکیده

We show that for a uniformly irreducible random walk on graph, with bounded range, there is Floyd function which the converges to its corresponding boundary. Moreover if we add assumptions, $p^{(n)}(v,w)\leq C \rho^n$, where $\rho < 1$ spectral radius, then any $f$ satisfies $\sum_{n=1}^{\infty}nf(n)<\infty$, Dirichlet problem respect boundary solvable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Walks on Random Graphs

The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...

متن کامل

Random walks on graphs

Let G = (V,E) be a connected, undirected graph. We shall consider the following model of a random walk on G. The walk starts out at time 0 in some initial distribution on the vertex set V ; the initial condition may be deterministic, which corresponds to the distribution assigning probability 1 to a single vertex. The random walk is constructed as follows. There are independent unit rate Poisso...

متن کامل

Random walks on random graphs

Random walks on random graphs – p. 1/2

متن کامل

Random and Pseudo-Random Walks on Graphs

Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we study random walks on general regular graphs, leading to a the randomized logspace algo...

متن کامل

Random and Pseudo-Random Walks on Graphs

Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we will study random walks on general graphs, leading to a the randomized logspace algorit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Arkiv för Matematik

سال: 2022

ISSN: ['0004-2080', '1871-2487']

DOI: https://doi.org/10.4310/arkiv.2022.v60.n1.a8